On the existence of k edge-disjoint 2-connected spanning subgraphs
نویسنده
چکیده
We prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected) spanning subgraphs. By using this result we can settle special cases of two conjectures, due to Kriesell and Thomassen, respectively: we show that every 12-connected graph G has a spanning tree T for which G− E(T ) is 2-connected, and that every 18-connected graph has a 2-connected orientation. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Packing of rigid spanning subgraphs and spanning trees
We prove that every (6k + 2`, 2k)-connected simple graph contains k rigid and ` connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6-connected graph is rigid for which our approach ...
متن کاملHighly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
We prove that there is no degree of connectivity which will guarantee that a hypergraph contains two edge-disjoint spanning connected subhypergraphs. We also show that Edmonds’ theorem on arc-disjoint branchings cannot be extended to directed hypergraphs. Here we use a definition of a directed hypergraph that naturally generalizes the notion of a directed graph. For standard notation and result...
متن کاملSupereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We also determine several...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملConditions for families of disjoint k-connected subgraphs in a graph
In [Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density, Discrete Math. 309 (2009), 997–1000.], Böhme and Kostochka showed that every large enough graph with sufficient edge density contains either a kconnected subgraph of order at least r or a family of r vertex-disjoint k-connected subgraphs. Motivated by this, in this note we explore the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 95 شماره
صفحات -
تاریخ انتشار 2005